Self-Organizing Sparse Codes

نویسندگان

  • Yangqing Jia
  • Sergey Karayev
چکیده

Sparse coding as applied to natural image patches learns Gabor-like components that resemble those found in the lower areas of the visual cortex. This biological motivation for sparse coding would also suggest that the learned receptive field elements be organized spatially by their response properties. However, the factorized prior in the original sparse coding model does not enforce this. We investigate ways of enforcing a topography over the learned codes in a locally self-organizing map approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-Organization Model of Feature Columns and Face Responsive Neurons in the Temporal Cortex

We investigate a self-organizing network model to account for the computational property of the inferotemporal cortex. The network can learn sparse codes for given data with organizing their topographic mapping. Simulation experiments are performed using real face images composed of different individuals at different viewing directions, and the results show that the network evolves the informat...

متن کامل

Learning Sparse, Distributed Representations using the Hebbian Principle

The “fire together, wire together” Hebbian model is a central principle for learning in neuroscience, but surprisingly, it has found limited applicability in modern machine learning. In this paper, we take a first step towards bridging this gap, by developing flavors of competitive Hebbian learning which produce sparse, distributed neural codes using online adaptation with minimal tuning. We pr...

متن کامل

Self-Organizing Maps for Time Series

We review a recent extension of the self-organizing map (SOM) for temporal structures with a simple recurrent dynamics leading to sparse representations, which allows an efficient training and a combination with arbitrary lattice structures. We discuss its practical applicability and its theoretical properties. Afterwards, we put the approach into a general framework of recurrent unsupervised m...

متن کامل

Multi-Scale Model-Based Skeletonization of Object Shapes Using Self-Organizing Maps

In this paper, a new skeletonization algorithm suitable for the skeletonization of sparse shape is described. It is based on Self-Organizing Maps (SOM) – a class of neural networks with unsupervised learning. The so-called structured SOM with local shape attributes such as scale and connectivity of vertices are used to determine the object shape in the form of piecewise linear skeletons. The lo...

متن کامل

Self-organizing maps for the skeletonization of sparse shapes

This paper presents a method for computing the skeleton of planar shapes and objects which exhibit sparseness (lack of connectivity), within their image regions. Such sparseness in images may occur due to poor lighting conditions, incorrect thresholding or image subsampling. Furthermore, in document image analysis, sparse shapes are characteristic of texts faded due to aging and/or poor ink qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010